The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
We investigate the computational complexity of two decision problems concerning the existence of certain acyclic subhypergraphs of a given hypergraph, namely the Spanning Acyclic Subhypergraph problem and the Maximum Acyclic Subhypergraph problem. The former is about the existence of an acyclic subhypergraph such that each vertex of the input hypergraph is contained in at least one hyperedge of the...
In this paper we analyze the complexity of the maximum cardinality b-matching problem in k-uniform hypergraphs. b-matching is the following problem: for a given b ∈ ℕ and a hypergraph $\mathcal{H}=(V,\mathcal{E})$ , |V| = n, a subset with maximum cardinality is sought so that no vertex is contained in more than b hyperedges of M. The b-matching problem is a prototype...
The k-level crossing minimization problem for graphs has received much interest in the graph drawing literature. In this paper we focus on the special case of trees. We show that the 2-level crossing minimization problem for trees where the order of the vertices on one level is fixed is solvable in quadratic time. We also show that the k-level crossing minimization problem for trees for an arbitrary...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.